Gromov–Witten invariants of ℙ1and Eynard–Orantin invariants
نویسندگان
چکیده
منابع مشابه
ON THE USE OF KULSHAMMER TYPE INVARIANTS IN REPRESENTATION THEORY
Since 2005 a new powerful invariant of an algebra has emerged using the earlier work of Horvath, Hethelyi, Kulshammer and Murray. The authors studied Morita invariance of a sequence of ideals of the center of a nite dimensional algebra over a eld of nite characteristic. It was shown that the sequence of ideals is actually a derived invariant, and most recently a slightly modied version o...
متن کاملon some invariants of finite groups
in this note we are going to survey several invariants of finite groups related either to their orders or to generating sets or to lattices of subgroups. some relations among these invariants will be exhibited. special attention will be paid to monotonicity of them.
متن کاملCharacterizing Algebraic Invariants by Differential Radical Invariants
We prove that any invariant algebraic set of a given polynomial vector field can be algebraically represented by one polynomial and a finite set of its successive Lie derivatives. This so-called differential radical characterization relies on a sound abstraction of the reachable set of solutions by the smallest variety that contains it. The characterization leads to a differential radical invar...
متن کاملOn Jones knot Invariants and Vassiliev Invariants
We show that the n-th derivative of a quantum group invariant, evaluated at 1, is a Vassiliev invariant while the derivative of the Jones polynomial, evaluated at a real number 6 = 1, is not a Vassiliev in variant. The coeecients of the classical Conway polynomial are known to be Vassiliev invariants. We show that the coeecients of the Jones polynomial are not vassiliev invariants.
متن کاملSchematic Invariants by Reduction to Ground Invariants
Computation of invariants, which are approximate reachability information for state-space search problems such as AI planning, has been considered to be more scalable when using a schematic representation of actions/events rather than an instantiated/ground representation. A disadvantage of schematic algorithms, however, is their complexity, which also leads to high runtimes when the number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometry & Topology
سال: 2014
ISSN: 1364-0380,1465-3060
DOI: 10.2140/gt.2014.18.1865